1 resultado para biologically active compounds
em Bulgarian Digital Mathematics Library at IMI-BAS
Filtro por publicador
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (27)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (4)
- Aquatic Commons (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (15)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (31)
- B-Digital - Universidade Fernando Pessoa - Portugal (3)
- Biblioteca de Teses e Dissertações da USP (5)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (19)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (6)
- Bioline International (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (38)
- Brock University, Canada (14)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (5)
- CentAUR: Central Archive University of Reading - UK (34)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (39)
- Cochin University of Science & Technology (CUSAT), India (11)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (8)
- Deakin Research Online - Australia (31)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (1)
- Digital Commons at Florida International University (9)
- Digital Knowledge Repository of Central Drug Research Institute (1)
- DigitalCommons@The Texas Medical Center (11)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (6)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (16)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (42)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico de Bragança (3)
- Instituto Politécnico de Viseu (2)
- Instituto Politécnico do Porto, Portugal (3)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (50)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Publishing Network for Geoscientific & Environmental Data (2)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (51)
- Queensland University of Technology - ePrints Archive (124)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (5)
- Repositório Institucional da Universidade de Brasília (3)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (140)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (5)
- Universidad de Alicante (5)
- Universidad Politécnica de Madrid (2)
- Universidade de Lisboa - Repositório Aberto (4)
- Universidade Estadual Paulista "Júlio de Mesquita Filho" (UNESP) (4)
- Universidade Federal do Pará (11)
- Universidade Federal do Rio Grande do Norte (UFRN) (12)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (2)
- Université de Montréal (2)
- Université de Montréal, Canada (23)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (1)
- University of Michigan (1)
- University of Queensland eSpace - Australia (31)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
P systems or Membrane Computing are a type of a distributed, massively parallel and non deterministic system based on biological membranes. They are inspired in the way cells process chemical compounds, energy and information. These systems perform a computation through transition between two consecutive configurations. As it is well known in membrane computing, a configuration consists in a m-tuple of multisets present at any moment in the existing m regions of the system at that moment time. Transitions between two configurations are performed by using evolution rules which are in each region of the system in a non-deterministic maximally parallel manner. This work is part of an exhaustive investigation line. The final objective is to implement a HW system that evolves as it makes a transition P-system. To achieve this objective, it has been carried out a division of this generic system in several stages, each of them with concrete matters. In this paper the stage is developed by obtaining the part of the system that is in charge of the application of the active rules. To count the number of times that the active rules is applied exist different algorithms. Here, it is presents an algorithm with improved aspects: the number of necessary iterations to reach the final values is smaller than the case of applying step to step each rule. Hence, the whole process requires a minor number of steps and, therefore, the end of the process will be reached in a shorter length of time.